Centroidal Localization Game
نویسندگان
چکیده
منابع مشابه
Centroidal localization game
One important problem in a network G is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in G. For instance, the famous metric dimension of a graph G is the minimum number k of detectors placed in some vertices {v1, · · · , vk} such that the vector (d1, · · · , dk) of the distances d(vi, r) between the detectors and the entity’s location r allow...
متن کاملCentroidal bases in graphs
We introduce the notion of a centroidal locating set of a graph G, that is, a set L of vertices such that all vertices in G are uniquely determined by their relative distances to the vertices of L. A centroidal locating set of G of minimum size is called a centroidal basis, and its size is the centroidal dimension CD(G). This notion, which is related to previous concepts, gives a new way of ide...
متن کاملEdge-Weighted Centroidal Voronoi Tessellations
Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CV...
متن کاملA Localization Game in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) support data collection and distributed data processing by means of very small sensing devices that are easy to tamper and clone: therefore classical security solutions based on access control and strong authentication are difficult to deploy. In this paper we look at the problem of assessing the reliability of node localization data from a game theoretical viewp...
متن کاملLocalization game on geometric and planar graphs
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph G we want to localize a walking agent by checking his distance to as few vertices as possible. The model we introduce is based on a pursuit graph game that resembles the famous Cops and Robbers game. It can be considered as a game theoretic variant of the metric dimension of a graph. We provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/7488